package Examin.WangYi2;

import java.util.*;

public class 大风车 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int len = 2*n-1;
        ArrayList<String> paths = new ArrayList<String>();
        //第n行全是*,每一行有len个字符,第1列,第n列全是*
        for (int i = 0; i < n-1; i++) {
            StringBuilder sb = new StringBuilder();
            for (int j = 0; j < len; j++) {
                if(i==0 && j>=n-1){
                    sb.append("*");
                    continue;
                }

                if(j==0 || j==n-1 || j==i || j==len-i-1){
                    sb.append("*");
                }else{
                    sb.append(" ");
                }
            }
            paths.add(sb.toString());
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < len; i++) {
            sb.append("*");
        }
        paths.add(sb.toString());
        for (int i = n-2; i >=0 ; i--) {
            paths.add(new StringBuilder(paths.get(i)).reverse().toString());
        }
        for (String path : paths) {
            System.out.println(path);
        }


    }
}
